Перевод: со всех языков на все языки

со всех языков на все языки

finite semigroup

См. также в других словарях:

  • Semigroup — This article is about the algebraic structure. For applications to differential equations, see C0 semigroup. In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative binary operation. A semigroup… …   Wikipedia

  • Semigroup action — In algebra and theoretical computer science, an action or act of a semigroup on a set is a rule which associates to each element of the semigroup a transformation of the set in such a way that the product of two elements of the semigroup (using… …   Wikipedia

  • Transformation semigroup — In algebra, a transformation semigroup (or composition semigroup) is a collection of functions from a set to itself which is closed under function composition. If it includes the identity function, it is a transformation (or composition) monoid.… …   Wikipedia

  • Completely regular semigroup — In mathematics, a completely regular semigroup is a semigroup in which every element is in some subgroup of the semigroup. The class of completely regular semigroups forms an important subclass of the class of regular semigroups, the class of… …   Wikipedia

  • Numerical semigroup — In mathematics, a numerical semigroup is a special kind of a semigroup. Its underlying set is the set of all nonnegative integers except a finite number and the binary operation is the operation of addition of integers. Also, the integer 0 must… …   Wikipedia

  • C0-semigroup — In mathematics, a C0 semigroup, also known as a strongly continuous one parameter semigroup, is a generalization of the exponential function. Just as exponential functions provide solutions of scalar linear constant coefficient ordinary… …   Wikipedia

  • Approximately finite dimensional C*-algebra — In C* algebras, an approximately finite dimensional, or AF, C* algebra is one that is the inductive limit of a sequence of finite dimensional C* algebras. Approximate finite dimensionality was first defined and described combinatorially by… …   Wikipedia

  • Symmetric inverse semigroup — In modern algebra, the set mathcal{I} X of all partial one one transformations on a set X forms an inverse semigroup, called the symmetric inverse semigroup (or monoid) on X . In general mathcal{I} X is not commutative. More details are available …   Wikipedia

  • Automatic semigroup — In mathematics, an automatic semigroup is a finitely generated semigroup equipped with several regular languages over an alphabet representing a generating set. One of these languages determines canonical forms for the elements of the semigroup,… …   Wikipedia

  • Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… …   Wikipedia

  • Krohn–Rhodes theory — In mathematics and computer science, Krohn Rhodes theory is an approach to the study of finite semigroups and automata that seeks to decompose them in terms of elementary components. These turn out to correspond to finite aperiodic semigroups and …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»